On graphs with smallest eigenvalue at least −3 and their lattices
نویسندگان
چکیده
منابع مشابه
On distance-regular graphs with smallest eigenvalue at least -m
A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer m ≥ 2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least −m, diameter at least three and intersection number c2 ≥ 2.
متن کاملFat Hoffman graphs with smallest eigenvalue at least $-1-τ$
In this paper, we show that all fat Hoffman graphs with smallest eigenvalue at least −1−τ , where τ is the golden ratio, can be described by a finite set of fat (−1 − τ)-irreducible Hoffman graphs. In the terminology of Woo and Neumaier, we mean that every fat Hoffman graph with smallest eigenvalue at least −1−τ is anH-line graph, where H is the set of isomorphism classes of maximal fat (−1−τ)-...
متن کاملNotes on graphs with least eigenvalue at least -2
A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...
متن کاملFat Hoffman graphs with smallest eigenvalue greater than -3
In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing K1,2 with smallest eigenvalue greater than −3, where K1,2 is the Hoffman graph having one slim vertex and two fat vertices.
متن کاملEla Notes on Graphs with Least Eigenvalue
A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2018
ISSN: 0001-8708
DOI: 10.1016/j.aim.2018.09.004